The complexity of G-free colourability

The problem of determining if a graph is 2-colourable (i.e., bipartite) has long been known to have a simple polynomial time algorithm. Being 2-colourable is equivalent to having a bipartition of the vertex set where each cell is &-free. We extend this notion to determining if there exists a bipartition where each cell is G-free for some fixed graph G. One might expect that for some graphs other than K2, K2 there also exist polynomial time algorithms. Rather surprisingly WC show that for UZ~ graph G on more than two vertices the problem is NP-complete.